package com.jiang.daily.Q3065;

/**
 * @author Jiang
 * @version 1.0
 * @date 2025/01/14 0:11
 */
class Solution {
    public int minOperations(int[] nums, int k) {
        int res = 0;
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] < k) res++;
        }
        return res;
    }
}
